Relational languages for metadata integration
نویسندگان
چکیده
منابع مشابه
Metadata Enrichment for Automatic Data Entry Based on Relational Data Models
The idea of automatic generation of data entry forms based on data relational models is a common and known idea that has been discussed day by day more than before according to the popularity of agile methods in software development accompanying development of programming tools. One of the requirements of the automation methods, whether in commercial products or the relevant research projects, ...
متن کاملMetadata for object-relational data warehouse
For developing data warehouse (DW) and OnLine Analytical Processing (OLAP) systems, the dominant relational database reaches its limitations. On the way of the development, object-relational (O-R) database is preferred to get over those ones. This paper introduces metadata for data warehouse system on O-R database and specifies new kind of metadata for mapping from object-oriented environment t...
متن کاملA Metadata Integration Framework for
Semantic heterogeneity is the problem of determining whether a set of documents describe the same information. Two different documents may belong to different document types, using different document schemas, which makes it difficult to determine whether the two documents describe the same kinds of information. To deal with the problem, metadata can be used to provide a uniform interface to a c...
متن کاملRelational Technologies, Metadata and RDF
Metadata plays an important role in successfully understanding and querying data on the web. A number of metadata management solutions have already been developed but each is tailored to specific kinds of metadata. The Resource Description Framework (RDF) is a generic, flexible and powerful model which is becoming the de-facto standard for metadata representation on the Web. Its adoption has cr...
متن کاملFräıssé limits for infinite relational languages
We study Fräıssé limits for certain Fräıssé classes over infinite relational languages that behave similarly to those for finite languages. These include the Fräıssé classes of finite simplicial complexes, finite hypergraphs, and Sperner families on finite sets. With a natural choice of measure we show that almost all countable structures whose finite substructures lie in such a class are isomo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2005
ISSN: 0362-5915,1557-4644
DOI: 10.1145/1071610.1071618